Norms on complex matrices induced by complete homogeneous symmetric polynomials
نویسندگان
چکیده
We introduce a remarkable new family of norms on the space $n \times n$ complex matrices. These arise from combinatorial properties symmetric functions, and their construction validation involve probability theory, partition combinatorics, trace polynomials in noncommuting variables. Our enjoy many desirable analytic algebraic properties, such as an elegant determinantal interpretation ability to distinguish certain graphs that other matrix cannot. Furthermore, they give rise dimension-independent tracial inequalities. Their potential merits further investigation.
منابع مشابه
Characteristic polynomials of real symmetric random matrices
It is shown that the correlation functions of the random variables det(λ−X), in which X is a real symmetric N × N random matrix, exhibit universal local statistics in the large N limit. The derivation relies on an exact dual representation of the problem: the k-point functions are expressed in terms of finite integrals over (quaternionic) k × k matrices. However the control of the Dyson limit, ...
متن کاملRemarks on two symmetric polynomials and some matrices
By means of comp lete symmetric polynomials this paper gives a new proof for the Vander-monde determinant formula. Another alternative proof for this formula is obtained via the collocatio n matrices. It also gives a generalized relationship between the Vandermo nde, the Pascal and the Stirling matrices. A new app roach to obtain the explicit inverse of the Vandermo nde matrix is investigated. ...
متن کاملApproximation by homogeneous polynomials
A new, elementary proof is given for the fact that on a centrally symmetric convex curve on the plane every continuous even function can be uniformly approximated by homogeneous polynomials. The theorem has been proven before by Benko and Kroó, and independently by Varjú using the theory of weighted potentials. In higher dimension the new method recaptures a theorem of Kroó and Szabados, which ...
متن کاملOn discrete norms of polynomials
For a polynomial p of degree n<N we compare two norms: ‖p‖ := sup{|p(z)| : z ∈ C; |z| = 1} and ‖p‖N := sup {∣∣p (zj )∣∣ : j = 0, . . . , N − 1} ; zj = e2 i j N . We show that there exist universal constants C1 and C2 such that 1+ C1 log ( N N − n ) sup { ‖p‖ ‖p‖N : p ∈ Pn } C2 log ( N N − n ) + 1. © 2005 Elsevier Inc. All rights reserved.
متن کاملUnitary Completions Of Complex Symmetric And Skew Symmetric Matrices ∗
Unitary symmetric completions of complex symmetric matrices are obtained via Autonne decomposition. The problem arises from atomic physics. Of independent interest unitary skew symmetric completions of skew symmetric matrices are also obtained by Hua decomposition.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of The London Mathematical Society
سال: 2022
ISSN: ['1469-2120', '0024-6093']
DOI: https://doi.org/10.1112/blms.12679